Exploiting the Bandwidth-Memory Tradeoff in Multicast State Aggregation
نویسندگان
چکیده
Multicast data distribution is achieved through three mechanisms: rendezvous of senders with receivers, distribution tree building protocols, and multicast data forwarding. While the first two mechanisms have been extensively studied, scaling multicast forwarding state has not been addressed. The lack of efficient strategies for multicast forwarding state aggregation could seriously inhibit the deployment of inter-domain multicast, because there is no “natural” limit to the number of concurrent multicast groups, especially given the possible proliferation of lowbandwidth multicast groups. In this paper, we describe leaky aggregation, which carefully trades off gratuitous data distribution for reduced forwarding state. Our simulations show that the leaky strategy, under expected operating conditions, scales forwarding state as the number of “highbandwidth” groups. This is desirable scaling behavior, given that network capacity limits the number of such groups. Keywords— Multicast, Multicast Forwarding, State Aggregation
منابع مشابه
Aggregated Multicast with Inter-Group Tree Sharing
IP multicast suffers from scalability problems for large numbers of multicast groups, since each router keeps forwarding state proportional to the number of multicast tree passing through it. In this paper, we present and evaluate aggregated multicast, an approach to reduce multicast state. In aggregated multicast, multiple groups are forced to share a single delivery tree. At the expense of so...
متن کاملA Novel Multicast Tree Construction Algorithm for Multi-Radio Multi-Channel Wireless Mesh Networks
Many appealing multicast services such as on-demand TV, teleconference, online games and etc. can benefit from high available bandwidth in multi-radio multi-channel wireless mesh networks. When multiple simultaneous transmissions use a similar channel to transmit data packets, network performance degrades to a large extant. Designing a good multicast tree to route data packets could enhance the...
متن کاملSoMR: A scalable distributed QoS multicast routing protocol
Many Internet multicast applications such as teleconferencing and remote diagnosis have Qualityof-Service (QoS) requirements. The requirements can be additive (end-to-end delay), multiplicative (loss rate), or of a bottleneck nature (bandwidth). Given such diverse requirements, it is a challenging task to build QoS-constrained multicast trees in a large network where no global network state is ...
متن کاملQoS Scalable Tree Aggregation
Some of the main reasons which prevents the deployment of IP multicast are forwarding state scalability and control explosion problems. In this paper, we propose an algorithm called Q-STA (QoS Scalable Tree Aggregation) which reduces the number of forwarding states by allowing several groups to share the same tree. Q-STA accepts groups only if there is enough available bandwidth. Q-STA accepts ...
متن کاملA Probabilistic Predictive Multicast Algorithm in Ad Hoc Networks (PPMA)
Ad hoc networks are collections of mobile nodes communicating using wireless media, without any fixed infrastructure. Existing multicast protocols fall short in a harsh ad hoc mobile environment because node mobility causes conventional multicast trees to rapidly become outdated. The amount of bandwidth resources required for building up a multicast tree is commonly less than that required for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999